On the Zagreb index inequality of graphs with prescribed vertex degrees
نویسندگان
چکیده
منابع مشابه
On the Zagreb index inequality of graphs with prescribed vertex degrees
For a simple graph G with n vertices and m edges, the inequality M1(G)/n ≤ M2(G)/m, where M1(G) and M2(G) are the first and the second Zagreb indices of G, is known as Zagreb indices inequality. According to this inequality, a set S of integers is good if for every graph whose degrees of vertices are in S, the inequality holds. We characterize that an interval [a, a+n] is good if and only if a ...
متن کاملThe augmented Zagreb index, vertex connectivity and matching number of graphs
Let $Gamma_{n,kappa}$ be the class of all graphs with $ngeq3$ vertices and $kappageq2$ vertex connectivity. Denote by $Upsilon_{n,beta}$ the family of all connected graphs with $ngeq4$ vertices and matching number $beta$ where $2leqbetaleqlfloorfrac{n}{2}rfloor$. In the classes of graphs $Gamma_{n,kappa}$ and $Upsilon_{n,beta}$, the elements having maximum augmented Zagreb index are determined.
متن کاملNote on Properties of First Zagreb Index of Graphs
Let G be a graph. The first Zagreb M1(G) of graph G is defined as: M1(G) = uV(G) deg(u)2. In this paper, we prove that each even number except 4 and 8 is a first Zagreb index of a caterpillar. Also, we show that the fist Zagreb index cannot be an odd number. Moreover, we obtain the fist Zagreb index of some graph operations.
متن کاملOn vertex balance index set of some graphs
Let Z2 = {0, 1} and G = (V ,E) be a graph. A labeling f : V → Z2 induces an edge labeling f* : E →Z2 defined by f*(uv) = f(u).f (v). For i ε Z2 let vf (i) = v(i) = card{v ε V : f(v) = i} and ef (i) = e(i) = {e ε E : f*(e) = i}. A labeling f is said to be Vertex-friendly if | v(0) − v(1) |≤ 1. The vertex balance index set is defined by {| ef (0) − ef (1) | : f is vertex-friendly}. In this paper ...
متن کاملOn the vertex arboricity of graphs with prescribed size
ON THE VERTEX ARBORICITY OF GRAPHS WITH PRESCRIBED SIZE Nirmala Achuthan, N.R. Achuthan and L. Caccetta School of Mathematics and Statistics Curtin University of Technology G.P.O. Box U1987 PERTH WA 6845 Let ~(n) denote the class of simple graphs of order n and ~(n,m) the subclass of graphs with size m. G denotes the complement of a graph G. For a graph G, the vertex arboricity p(G), is the min...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2011
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.01.002